Using the variable width in a planar inductor on Kapton for optimizing its performance
نویسندگان
چکیده
منابع مشابه
EM-Simulation of Planar Inductor Performance for Epitaxial Silicon Processes
A 2.5D EM-simulator has been used to study how planar inductor performance is influenced by an epitaxial substrate. The simulation model used has been adjusted and verified by measurements on an octagonal inductor fabricated in a submicron CMOS technology. The impact of the epitaxial layer has been studied by sweeping it’s permittivity, thickness, and resistivity. The results show that typical ...
متن کاملthe u.s. policy in central asia and its impact on the colored revolutions in the region (the case study of tulip revolution in kyrgyzstan)
چکیده ندارد.
15 صفحه اولPlanar Inductor Design for High Power Applications
Design, simulation, and implementation of low profile microstrip spiral inductors for high power Industrial, Scientific and Medical (ISM) applications at the high frequency (HF-3–30 MHz) range are given for the first time. An accurate analytical model and algorithm have been developed to determine the simplified lumped element equivalent model parameters for spiral inductor and its physical dim...
متن کاملOn the Path-Width of Planar Graphs
In this paper, we present a result concerning the relation between the path-with of a planar graph and the path-width of its dual. More precisely, we prove that for a 3-connected planar graph G, pw(G) ≤ 3pw(G∗) + 2. For 4-connected planar graphs, and more generally for Hamiltonian planar graphs, we prove a stronger bound pw(G∗) ≤ 2 pw(G) + c. The best previously known bound was obtained by Fomi...
متن کاملOn the Tree-Width of Planar Graphs
We prove that every planar graph G of tree-length has a tree-decomposition for which every bag is the union of at most 10 shortest paths of length O( ). As a consequence, the tree-width of G is bounded by O( ), generalizing the linear local tree-width result of planar graphs, since the tree-length of a graph does not exceed its diameter. Such a tree-decomposition can be computed in polynomial t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES
سال: 2017
ISSN: 1300-0632,1303-6203
DOI: 10.3906/elk-1606-343